TSTP Solution File: SYN992^1 by cocATP---0.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SYN992^1 : TPTP v7.5.0. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n015.cluster.edu---x86_64 x86_64--- ------Linux 3.10.0-693.el7.x86_64
% Model    : Unavailable
% CPU      : Unavailable
% Memory   : Unavailable
% OS       : Unavailable
% CPULimit : 300s
% WCLimit  : 0s
% DateTime : Mon Mar 28 13:41:28 EDT 2022

% Result   : Theorem 0.76s 0.99s
% Output   : Proof 0.76s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem    : SYN992^1 : TPTP v7.5.0. Bugfixed v4.0.0.
% 0.06/0.10  % Command    : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.30  % Computer   : n015.cluster.edu
% 0.10/0.30  % Model      : x86_64 x86_64
% 0.10/0.30  % CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % RAMPerCPU  : 8042.1875MB
% 0.10/0.30  % OS         : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % DateTime   : Thu Mar 10 21:35:32 EST 2022
% 0.10/0.30  % CPUTime    : 
% 0.10/0.31  ModuleCmd_Load.c(213):ERROR:105: Unable to locate a modulefile for 'python/python27'
% 0.16/0.32  Python 2.7.5
% 0.76/0.99  Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% 0.76/0.99  FOF formula (<kernel.Constant object at 0x18e3e18>, <kernel.DependentProduct object at 0x2ab00b3765f0>) of role type named refl_type
% 0.76/0.99  Using role type
% 0.76/0.99  Declaring refl:((fofType->(fofType->Prop))->Prop)
% 0.76/0.99  FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) refl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((R X) X)))) of role definition named refl
% 0.76/0.99  A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) refl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((R X) X))))
% 0.76/0.99  Defined: refl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((R X) X)))
% 0.76/0.99  FOF formula ((ex (fofType->(fofType->Prop))) (fun (R:(fofType->(fofType->Prop)))=> (refl R))) of role conjecture named ax
% 0.76/0.99  Conjecture to prove = ((ex (fofType->(fofType->Prop))) (fun (R:(fofType->(fofType->Prop)))=> (refl R))):Prop
% 0.76/0.99  Parameter fofType_DUMMY:fofType.
% 0.76/0.99  We need to prove ['((ex (fofType->(fofType->Prop))) (fun (R:(fofType->(fofType->Prop)))=> (refl R)))']
% 0.76/0.99  Parameter fofType:Type.
% 0.76/0.99  Definition refl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((R X) X))):((fofType->(fofType->Prop))->Prop).
% 0.76/0.99  Trying to prove ((ex (fofType->(fofType->Prop))) (fun (R:(fofType->(fofType->Prop)))=> (refl R)))
% 0.76/0.99  Found ex_intro0000:=(ex_intro000 choice_operator):((ex (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x)))
% 0.76/0.99  Found (ex_intro000 choice_operator) as proof of ((ex (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x)))
% 0.76/0.99  Found ((ex_intro00 (fun (x1:fofType)=> (forall (A:Type), (A->((ex ((A->Prop)->A)) (fun (co:((A->Prop)->A))=> (forall (P:(A->Prop)), (((ex A) (fun (x:A)=> (P x)))->(P (co P)))))))))) choice_operator) as proof of ((ex (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x)))
% 0.76/0.99  Found (((ex_intro0 (fun (y:(fofType->Prop))=> (y x))) (fun (x1:fofType)=> (forall (A:Type), (A->((ex ((A->Prop)->A)) (fun (co:((A->Prop)->A))=> (forall (P:(A->Prop)), (((ex A) (fun (x0:A)=> (P x0)))->(P (co P)))))))))) choice_operator) as proof of ((ex (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x)))
% 0.76/0.99  Found ((((ex_intro (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x))) (fun (x1:fofType)=> (forall (A:Type), (A->((ex ((A->Prop)->A)) (fun (co:((A->Prop)->A))=> (forall (P:(A->Prop)), (((ex A) (fun (x0:A)=> (P x0)))->(P (co P)))))))))) choice_operator) as proof of ((ex (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x)))
% 0.76/0.99  Found (fun (x:fofType)=> ((((ex_intro (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x))) (fun (x1:fofType)=> (forall (A:Type), (A->((ex ((A->Prop)->A)) (fun (co:((A->Prop)->A))=> (forall (P:(A->Prop)), (((ex A) (fun (x0:A)=> (P x0)))->(P (co P)))))))))) choice_operator)) as proof of ((ex (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x)))
% 0.76/0.99  Found (fun (x:fofType)=> ((((ex_intro (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x))) (fun (x1:fofType)=> (forall (A:Type), (A->((ex ((A->Prop)->A)) (fun (co:((A->Prop)->A))=> (forall (P:(A->Prop)), (((ex A) (fun (x0:A)=> (P x0)))->(P (co P)))))))))) choice_operator)) as proof of (forall (x:fofType), ((ex (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x))))
% 0.76/0.99  Found (choice000 (fun (x:fofType)=> ((((ex_intro (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x))) (fun (x1:fofType)=> (forall (A:Type), (A->((ex ((A->Prop)->A)) (fun (co:((A->Prop)->A))=> (forall (P:(A->Prop)), (((ex A) (fun (x0:A)=> (P x0)))->(P (co P)))))))))) choice_operator))) as proof of ((ex (fofType->(fofType->Prop))) (fun (R:(fofType->(fofType->Prop)))=> (refl R)))
% 0.76/0.99  Found ((choice00 (fun (x3:fofType) (x20:(fofType->Prop))=> (x20 x3))) (fun (x:fofType)=> ((((ex_intro (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x))) (fun (x1:fofType)=> (forall (A:Type), (A->((ex ((A->Prop)->A)) (fun (co:((A->Prop)->A))=> (forall (P:(A->Prop)), (((ex A) (fun (x0:A)=> (P x0)))->(P (co P)))))))))) choice_operator))) as proof of ((ex (fofType->(fofType->Prop))) (fun (R:(fofType->(fofType->Prop)))=> (refl R)))
% 0.76/0.99  Found (((choice0 (fofType->Prop)) (fun (x3:fofType) (x20:(fofType->Prop))=> (x20 x3))) (fun (x:fofType)=> ((((ex_intro (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x))) (fun (x1:fofType)=> (forall (A:Type), (A->((ex ((A->Prop)->A)) (fun (co:((A->Prop)->A))=> (forall (P:(A->Prop)), (((ex A) (fun (x0:A)=> (P x0)))->(P (co P)))))))))) choice_operator))) as proof of ((ex (fofType->(fofType->Prop))) (fun (R:(fofType->(fofType->Prop)))=> (refl R)))
% 0.76/0.99  Found ((((choice fofType) (fofType->Prop)) (fun (x3:fofType) (x20:(fofType->Prop))=> (x20 x3))) (fun (x:fofType)=> ((((ex_intro (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x))) (fun (x1:fofType)=> (forall (A:Type), (A->((ex ((A->Prop)->A)) (fun (co:((A->Prop)->A))=> (forall (P:(A->Prop)), (((ex A) (fun (x0:A)=> (P x0)))->(P (co P)))))))))) choice_operator))) as proof of ((ex (fofType->(fofType->Prop))) (fun (R:(fofType->(fofType->Prop)))=> (refl R)))
% 0.76/0.99  Found ((((choice fofType) (fofType->Prop)) (fun (x3:fofType) (x20:(fofType->Prop))=> (x20 x3))) (fun (x:fofType)=> ((((ex_intro (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x))) (fun (x1:fofType)=> (forall (A:Type), (A->((ex ((A->Prop)->A)) (fun (co:((A->Prop)->A))=> (forall (P:(A->Prop)), (((ex A) (fun (x0:A)=> (P x0)))->(P (co P)))))))))) choice_operator))) as proof of ((ex (fofType->(fofType->Prop))) (fun (R:(fofType->(fofType->Prop)))=> (refl R)))
% 0.76/0.99  Got proof ((((choice fofType) (fofType->Prop)) (fun (x3:fofType) (x20:(fofType->Prop))=> (x20 x3))) (fun (x:fofType)=> ((((ex_intro (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x))) (fun (x1:fofType)=> (forall (A:Type), (A->((ex ((A->Prop)->A)) (fun (co:((A->Prop)->A))=> (forall (P:(A->Prop)), (((ex A) (fun (x0:A)=> (P x0)))->(P (co P)))))))))) choice_operator)))
% 0.76/0.99  Time elapsed = 0.279453s
% 0.76/0.99  node=92 cost=474.000000 depth=10
% 0.76/0.99  ::::::::::::::::::::::
% 0.76/0.99  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.76/0.99  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.76/0.99  ((((choice fofType) (fofType->Prop)) (fun (x3:fofType) (x20:(fofType->Prop))=> (x20 x3))) (fun (x:fofType)=> ((((ex_intro (fofType->Prop)) (fun (y:(fofType->Prop))=> (y x))) (fun (x1:fofType)=> (forall (A:Type), (A->((ex ((A->Prop)->A)) (fun (co:((A->Prop)->A))=> (forall (P:(A->Prop)), (((ex A) (fun (x0:A)=> (P x0)))->(P (co P)))))))))) choice_operator)))
% 0.76/0.99  % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
%------------------------------------------------------------------------------